The aggregation closure is polyhedral for packing and covering integer programs

Recently, Bodur, Del Pia, Dey, Molinaro and Pokutta studied the concept of aggregation cuts for packing covering integer programs. The closure is intersection all cuts. Bodur et al. strength this closure, but left open question whether polyhedral. In paper, we answer in positive, i.e., show that Finally, demonstrate a generalization, k-aggregation also polyhedral k.